Genetic Algorithm-Based Optimization Approach for an Uncapacitated Single Allocation P-hub Center Problem with more realistic cost structure

Authors

  • Hamed Farrokhi-Asl School of Industrial Engineering, Iran University of Science & Technology, Tehran, Iran
  • Masoud Rabbani School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
  • Razieh Heidari School of Industrial Engineering, College of Engineering, University of Tehran
Abstract:

A p-hub center network design problem is definition of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first time, we formulate costs as a summation of different parts: fixed cost, Health, Safety and Environment (HSE) cost, energy cost and personnel cost. Such integrated model results in a hard-to-solve nonlinear formulation. To validate the proposed model, a small scale problem instance of CAB dataset solved by LINGO software. Because of inability to solve bigger problems, we prepared a Genetic Algorithm (GA) by MATLAB software to solve complete problems of CAB and AP datasets.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Genetic algorithm-based optimization approach for an uncapacitated single allocation P-hub center problem with more realistic cost structure

A p-hub center network design problem consists of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first time...

full text

Polyhedral Analysis of Uncapacitated Single Allocation p-Hub Center Problems

In contrast to p-hub problems with a summation objective (p-hub median), minmax hub problems (p-hub center) have not attained much attention in the literature. In this paper, we give a polyhedral analysis of the uncapacitated single allocation p-hub center problem (USApHCP). The analysis will be based on a radius formulation which currently yields the most efficient solution procedures. We show...

full text

Uncapacitated single and multiple allocation p-hub center problems

The hub median problem is to locate hub facilities in a network and to allocate non-hub nodes to hub nodes such that the total transportation cost is minimized. In the hub center problem, the main objective is one of minimizing the maximum distance/cost between origin destination pairs. In this paper, we study uncapacitated hub center problems with either single or multiple allocation. Both pro...

full text

The Uncapacitated Single Allocation p-Hub Median Problem with Stepwise Cost Function

In this paper, we address a new version of the Uncapacitated Single Allocation p-Hub Median Problem (USApHMP) in which transportation costs on each edge are given by piecewise constant cost functions. In the classical USApHMP, transportation costs are modelled as linear functions of the transport volume, where a fixed discount factor on hubhub connections is introduced to simulate economies of ...

full text

Exact computational approaches to a stochastic uncapacitated single allocation p-hub center problem

These papers are produced by Cambridge Judge Business School, University of Cambridge. They are circulated for discussion purposes only. Their contents should be considered preliminary and are not to be quoted without the authors' permission. The stochastic uncapacitated single allocation p-hub center problem is an extension of the deter-ministic version which aims to minimize the longest origi...

full text

The p-hub center allocation problem

The p-hub center problem is to locate p hubs and to allocate non-hub nodes to hub nodes such that the maximum travel time (or distance) between any origin–destination pair is minimized. We address the p-hub center allocation problem, a subproblem of the location problem, where hub locations are given. We present complexity results and IP formulations for several versions of the problem. We esta...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 10  issue Issue 1

pages  108- 124

publication date 2017-05-03

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023